Sojourn Time in a Single-Server Queue with Threshold Service Rate Control
نویسندگان
چکیده
منابع مشابه
Sojourn Time in a Single-Server Queue with Threshold Service Rate Control
We study the sojourn time in a queueing system with a single exponential server, serving a Poisson stream of customers in order of arrival. Service is provided at a low or high rate, which can be adapted at exponential inspection times. When the number of customers in the system is above a given threshold, the service rate is upgraded to the high rate, otherwise, it is downgraded to the low rat...
متن کاملSojourn time tails in the single server queue with heavy-tailed service times
We consider the GI/GI/1 queue with regularly varying service requirement distribution of index −α. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1 − α, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution is regularly varying of index −α. That raises the question whether there exist service discipline...
متن کاملFINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION
A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.
متن کاملThe Sojourn Time Distribution in an Infinite Server Resequencing Queue with Dependent Interarrival and Service Times
We consider an infinite server resequencing queue, where arrivals are generated by jumps of a semi-Markov process and service times depend on the jumps of this process. The stationary distribution of the sojourn time, conditioned on the state of the semi-Markov process, is obtained both for the case of hyperexponential service times and for the case of a Markovian arrival process. For the gener...
متن کاملDynamic Service Rate Control for a Single Server Queue with Markov Modulated Arrivals
We consider the problem of service rate control of a single server queueing system when the arrival process is governed by a finite-state Markov-modulated Poisson process. There are two main technical contributions. First, in keeping with intuition, we show that the optimal service rate is non-decreasing in the number of customers in the system. That is, higher congestion rates warrant higher s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Applied Mathematics
سال: 2016
ISSN: 0036-1399,1095-712X
DOI: 10.1137/14097046x